Source Coding with Side Information at the Decoder and Uncertain Knowledge of the Correlation
نویسندگان
چکیده
منابع مشابه
Source Coding with Causal Side Information at the Decoder
2 ⌋ }. The i-th reconstruction is of the form X̂i(T, Y ), i.e., it is allowed to depend on the side information, but only causally. The motivation for studying this problem comes from source coding systems that are constrained to operate with no, or with limited, delay. Sequential source codes with a limited-delay encoder and a sequential, zero-delay, decoder with access to side information comp...
متن کاملSource Coding with Decoder Side Information
In this report, we study source coding problems with decoder side information (SI). Source coding problems with decoder side information are a special case of distributed source coding problems. We outline the relation between various distributed source coding problems in Table 1 with the help of Figure 1. For reference, we also include the standard single-source lossless and lossy compression ...
متن کاملSuperposition Coding for Source Coding with Side Information at the Decoder
Problems of noisy channel coding with side information at the encoder and of lossy source coding with side information at the decoder have many practical applications. Unfortunately, the theoretical performance bounds are obtained by randomly partitioning a randomly generated source or channel code into an ensemble of channel or source codes, which is highly non-practical. A scheme has recently...
متن کاملThe rate-distortion function for source coding with side information at the decoder
Let {(X,, Y,J}r= 1 be a sequence of independent drawings of a pair of dependent random variables X, Y. Let us say that X takes values in the finite set 6. It is desired to encode the sequence {X,} in blocks of length n into a binary stream*of rate R, which can in turn be decoded as a sequence { 2k}, where zk E %, the reproduct ion alphabet. The average distorjion level is (l/n) cl= 1 E[D(X,,z&,...
متن کاملOn zero-error source coding with decoder side information
Let ( ) be a pair of random variables distributed over a finite product set according to a probability distribution ( ). The following source coding problem is considered: the encoder knows , while the decoder knows and wants to learn without error. The minimum zero-error asymptotic rate of transmission is shown to be the complementary graph entropy of an associated graph. Thus, previous result...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Communications
سال: 2014
ISSN: 0090-6778
DOI: 10.1109/tcomm.2013.120413.130102